A On the Power of Substitution in the Calculus of Structures Novak Novakovi´c, Inria Lutz Straßburger, Inria There are two contributions in this paper. First, we give a direct proof of the known fact that Frege system

Source URL: www.lix.polytechnique.fr

• Logic
• Mathematical logic
• Propositional calculus
• Proof theory
• Automated theorem proving
• Logical truth
• Boolean algebra
• Frege system
• Substitution
• Natural deduction
• Hilbert system
• Sequent

Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e & LORIA2

Source URL: www.ensiie.fr

• Propositional calculus
• Proof theory
• Logic in computer science
• Boolean algebra
• Formal systems
• Natural deduction
• Curry–Howard correspondence
• Sequent calculus
• Frege system
• Logic
• Mathematical logic
• Mathematics

Proof complexity Boolean functions Craig’s interpolation Feasible interpolation Resolution Cutting planes The Frege System The interpolation technique in proof complexity Pavel Hrubeš University of Washington

Source URL: cav2013.forsyte.at

Curriculum Vitae Samuel R. Buss Professor of Mathematics and Computer Science Department of Mathematics University of California, San Diego

Source URL: euclid.ucsd.edu

• Logic
• Formal sciences
• Frege system
• Propositional calculus
• IEEE Symposium on Logic in Computer Science
• Mathematical logic
• Logic programming
• Proof theory
• Samuel Buss
• Theoretical computer science
• Logic in computer science
• Mathematics

Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds Yuval Filmus1 ? , Toniann Pitassi1 ? , and Rahul Santhanam2 1 University of Toronto, yuvalf,

Source URL: www.cs.toronto.edu

• Logic in computer science
• Automated theorem proving
• Frege system
• Propositional calculus
• Computational complexity theory
• Proof complexity
• Function
• Gottlob Frege
• Mathematical proof
• Mathematics
• Theoretical computer science
• Mathematical logic

Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds∗ Yuval Filmus University of Toronto Massimo Lauria

Source URL: www.cs.toronto.edu

• Computational complexity theory
• Conjunctive normal form
• Proof complexity
• PP
• IP
• Polynomial
• Boolean algebra
• Frege system
• MAX-3SAT
• Theoretical computer science
• Applied mathematics
• Logic in computer science

A Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds YUVAL FILMUS and TONIANN PITASSI, University of Toronto RAHUL SANTHANAM, University of Edinburgh

Source URL: www.cs.toronto.edu

• Computational complexity theory
• Logic in computer science
• Mathematical logic
• Proof theory
• Automated theorem proving
• Frege system
• Proof complexity
• Function
• Switching lemma
• Theoretical computer science
• Mathematics
• Logic

CHAPTER I An Introduction to Proof Theory Samuel R. Buss Departments of Mathematics and Computer Science, University of California, San Diego La Jolla, California[removed], USA

Source URL: math.ucsd.edu

• Propositional calculus
• Proof theory
• Model theory
• Metalogic
• First-order logic
• Substitution
• Deduction theorem
• Interpretation
• Frege system
• Logic
• Mathematical logic
• Mathematics

Proof complexity of propositional default logic

Source URL: eprints.whiterose.ac.uk

• Proof theory
• Logic in computer science
• Automated theorem proving
• Propositional calculus
• Logical syntax
• Frege system
• Sequent
• Proof calculus
• Proof complexity
• Logic
• Mathematical logic
• Theoretical computer science

ON THE PROOF COMPLEXITY OF DEEP INFERENCE PAOLA BRUSCOLI AND ALESSIO GUGLIELMI ABSTRACT. We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones,

Source URL: cs.bath.ac.uk

• Mathematics
• Propositional calculus
• Automated theorem proving
• Logic in computer science
• Frege system
• Cut-elimination theorem
• Analytic proof
• Sequent calculus
• Substitution
• Logic
• Mathematical logic
• Proof theory